Embedding and Coding below a 1-Generic Degree
نویسندگان
چکیده
We show that the theory of D(6 g), where g is a 2-generic or a 1-generic degree below 0′, interprets true first order arithmetic. To this end we show that 1-genericity is sufficient to find the parameters needed to code a set of degrees using Slaman and Woodin’s method of coding in Turing degrees. We also prove that any recursive lattice can be embedded below a 1-generic degree preserving top and bottom.
منابع مشابه
An improved and efficient stenographic scheme based on matrix embedding using BCH syndrome coding.
This paper presents a new stenographic scheme based on matrix embedding using BCH syndrome coding. The proposed method embeds massage into cover by changing some coefficients of cover. In this paper defining a number :::as char:::acteristic of the syndrome, which is invariant with respect to the cyclic shift, we propose a new embedding algorithm base on BCH syndrome coding, without finding ro...
متن کاملA nonlow2 R. E. Degree with the Extension of Embeddings Properties of a low2 Degree
We construct a nonlow2 r.e. degree d such that every extension of embedding property that holds below every low2 degree holds below d. Indeed, we can also guarantee the converse so that there is a low r.e. degree c such that that the extension of embedding properties true below c are exactly the ones true below d. Moreover, we can also guarantee that no b ≤ d is the base of a nonsplitting pair.
متن کاملDomination, forcing, array nonrecursiveness and relative recursive enumerability
We present some abstract theorems showing how domination properties equivalent to not being GL2 or array recursive can be used to construct sets generic for di¤erent notions of forcing. These theorems are then applied to give simple proofs of several old results. We also give a direct uniform proof of a recent result of Ambos-Spies, Ding, Wang and Yu [2009] that every degree above any not in GL...
متن کاملA weakly-2-generic which bounds a minimal degree
Jockusch showed that 2-generic degrees are downward dense below a 2-generic degree, but in the case of 1-generic degrees Kumabe, and independently Chong and Downey constructed a minimal degree computable from a 1-generic degree. We explore the tightness of these results. We solve a question of Barmpalias and Lewis-Pye by constructing a minimal degree computable from a weakly 2-generic one. The ...
متن کاملA Model of Authors’ Generic Competence of EAP Research Articles: A Qualitative Meta-Synthesis Approach
Genre analysis as an area of great concern in recent decades, involves the observation of linguistic features used by a determined discourse community. The research article (RA) is one of the most widely researched genres in academic writing which is realized through some rhetorical moves and discursive steps to achieve a communicative purpose. This study aimed at proposing a model of generic p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Notre Dame Journal of Formal Logic
دوره 44 شماره
صفحات -
تاریخ انتشار 2003